Stage-graph Representations
نویسندگان
چکیده
We consider graph applications of the well-known paradigm “killing two birds with one stone”. In the plane, this gives rise to a stage graph as follows: vertices are the points, and {u, II} is an edge if and only if the (infinite, straight) line segment joining u to u intersects the stage. Such graphs are shown to be comparability graphs of ordered sets of dimension 2. Similar graphs can be constructed when we have a fixed number k of stages on the plane. In this case, {u, u} is an edge if and only if the (straight) line segment uu intersects one of the k stages. In this paper, we study stage representations of stage graphs and give upper and lower bounds on the number of stages needed to represent a graph.
منابع مشابه
dominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملStage-graph Representations Jj Org-r Udiger Sack Y{k
We consider graph applications of the well-known paradigm \killing two birds with one stone". In the plane, this gives rise to a stage graph as follows: vertices are the points, and fu; vg is an edge if and only if the (innnite, straight) line segment joining u to v intersects the stage. Such graphs are shown to be comparability graphs of ordered sets of dimension 2. Similar graphs can be const...
متن کاملPartial Parallelization of Graph Partitioning Algorithm METIS
The METIS graph partitioning algorithm has three stages. The first stage, coarsening, takes a large graph, with vertices |V | and edges |E|, and creates successively smaller graphs that are good representations of the original graph. The second stage partitions the small graph. The third stage, refinement, projects and refines the partition of the smaller graph onto the original graph. We prese...
متن کاملAdjacency metric dimension of the 2-absorbing ideals graph
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 75 شماره
صفحات -
تاریخ انتشار 1997